The Complexity of Model Checking Higher-Order Fixpoint Logic
نویسندگان
چکیده
منابع مشابه
The Complexity of Model Checking Higher Order Fixpoint Logic
Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed λ-calculus and the modal μ-calculus. This makes it a highly expressive temporal logic that is capable of expressing various interesting correctness properties of programs that are not expressible in the modal μ-calculus. This paper provides complexity results for its model checking problem. In particular, we consider those fragme...
متن کاملModel Checking the First-Order Fragment of Higher-Order Fixpoint Logic
We present a model checking algorithm for HFL1, the firstorder fragment of Higher-Order Fixpoint Logic. This logic is capable of expressing many interesting properties which are not regular and, hence, not expressible in the modal μ-calculus. The algorithm avoids best-case exponential behaviour by localising the computation of functions and can be implemented symbolically using BDDs. We show ho...
متن کاملThe Complexity of Model Checking (Collapsible) Higher-Order Pushdown Systems
We study (collapsible) higher-order pushdown systems — theoretically robust and wellstudied models of higher-order programs — along with their natural subclass called (collapsible) higher-order basic process algebras. We provide a comprehensive analysis of the model checking complexity of a range of both branching-time and linear-time temporal logics. We obtain tight bounds on data, expression,...
متن کاملThree notes on the complexity of model checking fixpoint logic with chop
This paper analyses the complexity of model checking Fixpoint Logic with Chop – an extension of the modal μ-calculus with a sequential composition operator. It uses two known game-based characterisations to derive the following results: the combined model checking complexity as well as the data complexity of FLC are EXPTIMEcomplete. This is already the case for its alternation-free fragment. Th...
متن کاملTractable model checking for fragments of higher-order coalition logic
A number of popular logical formalisms for representing and reasoning about the abilities of teams or coalitions of agents have been proposed beginning with the Coalition Logic (CL) of Pauly. Ågotnes et al introduced a means of succinctly expressing quantification over coalitions without compromising the computational complexity of model checking in CL by introducing Quantified Coalition Logic ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logical Methods in Computer Science
سال: 2007
ISSN: 1860-5974
DOI: 10.2168/lmcs-3(2:7)2007